Parallel Routing Algorithms in Benes and Clos Networks: A Survey
نویسندگان
چکیده
Benes and Clos networks are an important class of multistage interconnection network due to their expandability and modularity. In this article we present a survey of parallel routing algorithms in Benes and Clos Networks. These parallel routing algorithms are compared in terms of their interconnection topologies, implementation and time complexity. Index Terms : Multistage Interconnection network, Parallel routing algorithm, Parallel computers, Benes network, Clos network, Rearrangeable, Blocking, Non-Blocking.
منابع مشابه
Hardware Implementation of Parallel Algorithm for Setting Up Benes Networks
Both Benes and Clos networks are rearrangeably non-blocking multi-stage interconnection networks. Benes network is a special case of Clos network which has inputs and outputs. The Benes network is constructed with switching nodes recursively. Due to their non-blocking property and relative smaller number of crosspoints, Benes/Clos networks have received much attention in both academia and indus...
متن کاملUpper Bound Analysis and Routing in Optical Benes Networks
Multistage Interconnection Networks (MIN) are popular in switching and communication applications. It has been used in telecommunication and parallel computing systems for many years. The new challenge facing optical MIN is crosstalk, which is caused by coupling two signals within a switching element. Crosstalk is not too big an issue in the Electrical Domain, but due to the stringent Bit Error...
متن کاملArbitrary Size Benes Networks
The Benes network is a rearrangeable nonblocking network which can realize any arbitrary permutation. Overall, the r-dimensional Benes network connects 2 r inputs to 2 r outputs through 2r ? 1 levels of 2 2 switches. Each level of switches consists of 2 r?1 switches, and hence the size of the network has to be a power of two. In this paper, we extend Benes networks to arbitrary sizes. We also s...
متن کاملLiterature Survey of nonblocking network topologies
The performance of a parallel computer greatly depends upon how, the different processors are capable of exchanging data. This, thus require an arbitrary permutation (nonblocking) to be done by the connection networks. A nonblocking network is capable of providing N parallel paths between a pair of nodes forming any arbitrary permutation. In this paper, we present three different simple nonbloc...
متن کاملA Modified Buffered Adaptive Algorithm for Routing in Optical Benes Network
The Benes network is capable of setting its own switches dynamically which makes it a best example of a self routing network. The network is capable of realizing a rich class of permutations. In this paper there is an overview of the how routing is done in Benes network and a new algorithm is proposed for routing of the data packets in order to turn into a non-blocking network. Keywords— Blocki...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015